6 research outputs found
Comprehensive Training and Evaluation on Deep Reinforcement Learning for Automated Driving in Various Simulated Driving Maneuvers
Developing and testing automated driving models in the real world might be
challenging and even dangerous, while simulation can help with this, especially
for challenging maneuvers. Deep reinforcement learning (DRL) has the potential
to tackle complex decision-making and controlling tasks through learning and
interacting with the environment, thus it is suitable for developing automated
driving while not being explored in detail yet. This study carried out a
comprehensive study by implementing, evaluating, and comparing the two DRL
algorithms, Deep Q-networks (DQN) and Trust Region Policy Optimization (TRPO),
for training automated driving on the highway-env simulation platform.
Effective and customized reward functions were developed and the implemented
algorithms were evaluated in terms of onlane accuracy (how well the car drives
on the road within the lane), efficiency (how fast the car drives), safety (how
likely the car is to crash into obstacles), and comfort (how much the car makes
jerks, e.g., suddenly accelerates or brakes). Results show that the TRPO-based
models with modified reward functions delivered the best performance in most
cases. Furthermore, to train a uniform driving model that can tackle various
driving maneuvers besides the specific ones, this study expanded the
highway-env and developed an extra customized training environment, namely,
ComplexRoads, integrating various driving maneuvers and multiple road scenarios
together. Models trained on the designed ComplexRoads environment can adapt
well to other driving maneuvers with promising overall performance. Lastly,
several functionalities were added to the highway-env to implement this work.
The codes are open on GitHub at https://github.com/alaineman/drlcarsim-paper.Comment: 6 pages, 3 figures, accepted by the 26th IEEE International
Conference on Intelligent Transportation Systems (ITSC 2023
Acquiescence and Extremity in Cross-National Surveys: Domain Dependence and Country-Level Correlates
Likert-type rating scales are susceptible to response styles, such as acquiescence and extremity scoring. Although it is widely acknowledged that response styles can seriously invalidate findings of cross-cultural research, their theoretical underpinnings are hardly explored. The current study analyzed domain-dependency and country differences in acquiescence and extremity scoring in a large dataset of the International Social Survey Program. The hypothesis that response styles are more likely in domains with a high personal relevance compared to domains with a low personal relevance was tentatively confirmed. Correlations with various cultural, psychological, and economic variables were investigated. We found that acquiescence was negatively related to affluence, individualism, and well-being, while extremity was only negatively related to well-being. Positive associations were found between uncertainty avoidance and both acquiescence and extremity
Computational pan-genomics: status, promises and challenges
International audienceMany disciplines, from human genetics and oncology to plant breeding, microbiology and virology, commonly face the challenge of analyzing rapidly increasing numbers of genomes. In case of Homo sapiens, the number of sequenced genomes will approach hundreds of thousands in the next few years. Simply scaling up established bioinformatics pipelines will not be sufficient for leveraging the full potential of such rich genomic data sets. Instead, novel, qualitatively different computational methods and paradigms are needed. We will witness the rapid extension of computational pan-genomics, a new sub-area of research in computational biology. In this article, we generalize existing definitions and understand a pan-genome as any collection of genomic sequences to be analyzed jointly or to be used as a reference. We examine already available approaches to construct and use pan-genomes, discuss the potential benefits of future technologies and methodologies and review open challenges from the vantage point of the above-mentioned biological disciplines. As a prominent example for a computational paradigm shift, we particularly highlight the transition from the representation of reference genomes as strings to representations as graphs. We outline how this and other challenges from different application domains translate into common computational problems, point out relevant bioinformatics techniques and identify open problems in computer science. With this review, we aim to increase awareness that a joint approach to computational pan-genomics can help address many of the problems currently faced in various domains
Computational pan-genomics: Status, promises and challenges
Many disciplines, from human genetics and oncology to plant breeding, microbiology and virology, commonly face the challenge of analyzing rapidly increasing numbers of genomes. In case of Homo sapiens, the number of sequenced genomes will approach hundreds of thousands in the next few years. Simply scaling up established bioinformatics pipelines will not be sufficient for leveraging the full potential of such rich genomic data sets. Instead, novel, qualitatively different Computational methods and paradigms are needed.We will witness the rapid extension of Computational pan-genomics, a new sub-area of research in Computational biology. In this article, we generalize existing definitions and understand a pangenome as any collection of genomic sequences to be analyzed jointly or to be used as a reference. We examine already available approaches to construct and use pan-genomes, discuss the potential benefits of future technologies and methodologies and review open challenges from the vantage point of the above-mentioned biological disciplines. As a prominent example for a Computational paradigm shift, we particularly highlight the transition from the representation of reference genomes as strings to representations
Extremal graphs for threshold metric dimension
In this thesis, we consider the threshold metric dimension problem of graphs, related to and motivated by source detection.We construct a graph G = (V,E) for a given set of sensors of size m: {s1, s2, ..., sm} and a range k > 0. We want that each node v â V has a unique combination of distances (dk (s1, v),dk (s2, v), ...,dk (sm, v)), where dk is the distance function in a graph limited by the range k (the distance is denoted as being â if the distance is larger than k). Our aim in this thesis is to construct such a graph that is extremal in size, that is: the vertex set V is as large as possible. We shall give such constructions with proof for optimality up to k = 3 and general mand a different construction with incomplete proof for optimality for general k and m. For any construction we will prove that each vertex is uniquely identified.Furthermore, we will compare our results to another paper with a similar conclusion about the extremal size of graphs with metric dimension m and a given diameter D.AM3000Applied Mathematic